A propositional system induced by Japaridze's approach to IF logic

نویسنده

  • Wenyan Xu
چکیده

Cirquent calculus is a new proof-theoretic and semantic approach introduced for the needs of computability logic by G.Japaridze, who also showed that, through cirquent calculus, one can capture, refine and generalize independence-friendly (IF) logic. Specifically, the approach allows us to account for independence from propositional connectives in the same spirit as the traditional IF logic accounts for independence from quantifiers. Japaridze’s treatment of IF logic, however, was purely semantical, and no deductive system was proposed. The present paper constructs a formal system sound and complete w.r.t. the propositional fragment of Japaridze’s cirquentbased semantics for IF logic. Such a system can thus be considered an axiomatization of purely propositional IF logic in its full generality. MSC: primary: 03B47; secondary: 03B70; 68Q10; 68T27; 68T15.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

PSPACE-decidability of Japaridze's polymodal logic

In this paper we prove that Japaridze’s Polymodal Logic is PSPACE-decidable. To show this, we describe a decision procedure for satisfiability on hereditarily ordered frames that can be applied to obtain upper complexity bounds for various modal logics.

متن کامل

A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic

We study a propositional polymodal provability logic GLP introduced by G. Japaridze. The previous treatments of this logic, due to Japaridze and Ignatiev (see [11, 7]), heavily relied on some non-finitary principles such as transfinite induction up to ε0 or reflection principles. In fact, the closed fragment of GLP gives rise to a natural system of ordinal notation for ε0 that was used in [1] f...

متن کامل

Controlling Electrochemical Machining By Using a Fuzzy Logic Approach

New trends and the effect of key factors influence the quality of the holes produced by ECM processes. Researchers developed a fuzzy logic controller by adding intelligence to the ECM process. Maintaining optimum ECM process conditions ensures higher machining efficiency and performance. This paper presents the development of a fuzzy logic controller to add intelligence to the ECM process. An e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Logic Journal of the IGPL

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2014